0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n022.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1440
0.13/0.34	% WCLimit    : 180
0.13/0.34	% DateTime   : Thu Jul  4 07:36:24 EDT 2024
0.13/0.34	% CPUTime    : 
0.20/0.48	Running higher-order theorem proving
0.20/0.49	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p
0.20/0.52	# Version: 3.2.0-ho
0.20/0.52	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.52	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.52	# Starting ho_unfolding_3 with 900s (5) cores
0.20/0.52	# Starting ehoh_best2_full_lfho with 180s (1) cores
0.20/0.52	# Starting almost_fo_3_lam with 180s (1) cores
0.20/0.52	# Starting post_as_ho1 with 180s (1) cores
0.20/0.52	# post_as_ho1 with pid 14718 completed with status 0
0.20/0.52	# Result found by post_as_ho1
0.20/0.52	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.52	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.52	# Starting ho_unfolding_3 with 900s (5) cores
0.20/0.52	# Starting ehoh_best2_full_lfho with 180s (1) cores
0.20/0.52	# Starting almost_fo_3_lam with 180s (1) cores
0.20/0.52	# Starting post_as_ho1 with 180s (1) cores
0.20/0.52	# No SInE strategy applied
0.20/0.52	# Search class: HGUNS-FFSF32-SHSSMSBN
0.20/0.52	# partial match(1): HGUNF-FFSF32-SHSSMSBN
0.20/0.52	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.52	# Starting new_ho_10_cnf2 with 98s (1) cores
0.20/0.52	# new_ho_10_cnf2 with pid 14723 completed with status 0
0.20/0.52	# Result found by new_ho_10_cnf2
0.20/0.52	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.52	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.52	# Starting ho_unfolding_3 with 900s (5) cores
0.20/0.52	# Starting ehoh_best2_full_lfho with 180s (1) cores
0.20/0.52	# Starting almost_fo_3_lam with 180s (1) cores
0.20/0.52	# Starting post_as_ho1 with 180s (1) cores
0.20/0.52	# No SInE strategy applied
0.20/0.52	# Search class: HGUNS-FFSF32-SHSSMSBN
0.20/0.52	# partial match(1): HGUNF-FFSF32-SHSSMSBN
0.20/0.52	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.52	# Starting new_ho_10_cnf2 with 98s (1) cores
0.20/0.52	# Preprocessing time       : 0.002 s
0.20/0.52	# Presaturation interreduction done
0.20/0.52	
0.20/0.52	# Proof found!
0.20/0.52	# SZS status Theorem
0.20/0.52	# SZS output start CNFRefutation
0.20/0.52	thf(decl_sort1, type, mu: $tType).
0.20/0.52	thf(decl_28, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
0.20/0.52	thf(decl_32, type, mforall_ind: (mu > $i > $o) > $i > $o).
0.20/0.52	thf(decl_33, type, mforall_indset: ((mu > $i > $o) > $i > $o) > $i > $o).
0.20/0.52	thf(decl_35, type, mexists_ind: (mu > $i > $o) > $i > $o).
0.20/0.52	thf(decl_38, type, mbox_generic: ($i > $i > $o) > ($i > $o) > $i > $o).
0.20/0.52	thf(decl_39, type, mdia_generic: ($i > $i > $o) > ($i > $o) > $i > $o).
0.20/0.52	thf(decl_40, type, rel: $i > $i > $o).
0.20/0.52	thf(decl_41, type, mbox: ($i > $o) > $i > $o).
0.20/0.52	thf(decl_42, type, mdia: ($i > $o) > $i > $o).
0.20/0.52	thf(decl_43, type, mvalid: ($i > $o) > $o).
0.20/0.52	thf(decl_45, type, msymmetric: ($i > $i > $o) > $o).
0.20/0.52	thf(decl_46, type, positive: (mu > $i > $o) > $i > $o).
0.20/0.52	thf(decl_47, type, god: mu > $i > $o).
0.20/0.52	thf(decl_48, type, essence: (mu > $i > $o) > mu > $i > $o).
0.20/0.52	thf(decl_49, type, necessary_existence: mu > $i > $o).
0.20/0.52	thf(decl_50, type, esk1_0: $i).
0.20/0.52	thf(decl_51, type, esk2_0: $i).
0.20/0.52	thf(decl_52, type, epred1_1: mu > mu > $i > $o).
0.20/0.52	thf(decl_53, type, esk3_1: $i > $i).
0.20/0.52	thf(decl_54, type, esk4_1: $i > mu).
0.20/0.52	thf(decl_55, type, epred2_2: $i > mu > mu > $i > $o).
0.20/0.52	thf(decl_56, type, epred3_0: mu > $i > $o).
0.20/0.52	thf(decl_57, type, epred4_0: mu > $i > $o).
0.20/0.52	thf(decl_58, type, epred5_2: $i > mu > mu > $i > $o).
0.20/0.52	thf(decl_59, type, esk5_4: $i > mu > (mu > $i > $o) > $i > mu).
0.20/0.52	thf(decl_60, type, epred6_2: $i > mu > mu > $i > $o).
0.20/0.52	thf(decl_61, type, esk6_2: $i > mu > $i).
0.20/0.52	thf(mbox_generic, axiom, ((mbox_generic)=(^[X15:$i > $i > $o, X4:$i > $o, X3:$i]:(![X16:$i]:((~((X15 @ X3 @ X16))|(X4 @ X16)))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', mbox_generic)).
0.20/0.52	thf(defD1, axiom, ((god)=(^[X1:mu]:(mforall_indset @ (^[X19:mu > $i > $o]:(mimplies @ (positive @ X19) @ (X19 @ X1)))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', defD1)).
0.20/0.52	thf(mimplies, axiom, ((mimplies)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)=>(X5 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', mimplies)).
0.20/0.52	thf(mforall_indset, axiom, ((mforall_indset)=(^[X7:(mu > $i > $o) > $i > $o, X3:$i]:(![X8:mu > $i > $o]:((X7 @ X8 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', mforall_indset)).
0.20/0.52	thf(defD3, axiom, ((necessary_existence)=(^[X1:mu]:(mforall_indset @ (^[X20:mu > $i > $o]:(mimplies @ (essence @ X20 @ X1) @ (mbox @ (mexists_ind @ (^[X2:mu]:(X20 @ X2))))))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', defD3)).
0.20/0.52	thf(mexists_ind, axiom, ((mexists_ind)=(^[X11:mu > $i > $o, X3:$i]:(?[X1:mu]:((X11 @ X1 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', mexists_ind)).
0.20/0.52	thf(mbox, axiom, ((mbox)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(![X21:$i]:((~((rel @ Z1 @ X21))|(Z0 @ X21)))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', mbox)).
0.20/0.52	thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', mvalid)).
0.20/0.52	thf(mdia_generic, axiom, ((mdia_generic)=(^[X15:$i > $i > $o, X4:$i > $o, X3:$i]:(?[X16:$i]:(((X15 @ X3 @ X16)&(X4 @ X16)))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', mdia_generic)).
0.20/0.52	thf(thmT3, conjecture, (mvalid @ (mbox @ (mexists_ind @ (^[X1:mu]:(god @ X1))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', thmT3)).
0.20/0.52	thf(mforall_ind, axiom, ((mforall_ind)=(^[X6:mu > $i > $o, X3:$i]:(![X1:mu]:((X6 @ X1 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', mforall_ind)).
0.20/0.52	thf(axA5, axiom, (mvalid @ (positive @ necessary_existence)), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', axA5)).
0.20/0.52	thf(mdia, axiom, ((mdia)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(?[X22:$i]:(((rel @ Z1 @ X22)&(Z0 @ X22)))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', mdia)).
0.20/0.52	thf(thmT2, lemma, (mvalid @ (mforall_ind @ (^[X1:mu]:(mimplies @ (god @ X1) @ (essence @ god @ X1))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', thmT2)).
0.20/0.52	thf(corC, lemma, (mvalid @ (mdia @ (mexists_ind @ (^[X1:mu]:(god @ X1))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', corC)).
0.20/0.52	thf(msymmetric, axiom, ((msymmetric)=(^[X15:$i > $i > $o]:(![X17:$i, X18:$i]:(((X15 @ X17 @ X18)=>(X15 @ X18 @ X17)))))), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', msymmetric)).
0.20/0.52	thf(sym, axiom, (msymmetric @ rel), file('/export/starexec/sandbox/tmp/tmp.0Yl4YbRhiW/E---3.1_14637.p', sym)).
0.20/0.52	thf(c_0_17, plain, ((mbox_generic)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(![X16:$i]:((~((Z0 @ Z2 @ X16))|(Z1 @ X16)))))), inference(fof_simplification,[status(thm)],[mbox_generic])).
0.20/0.52	thf(c_0_18, plain, ((god)=(^[Z0/* 19 */:mu, Z1:$i]:(![X23:mu > $i > $o]:((((positive @ X23 @ Z1)=>(X23 @ Z0 @ Z1))))))), inference(fof_simplification,[status(thm)],[defD1])).
0.20/0.52	thf(c_0_19, plain, ((mimplies)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])).
0.20/0.52	thf(c_0_20, plain, ((mforall_indset)=(^[Z0/* 19 */:(mu > $i > $o) > $i > $o, Z1:$i]:(![X8:mu > $i > $o]:((Z0 @ X8 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_indset])).
0.20/0.52	thf(c_0_21, plain, ((necessary_existence)=(^[Z0/* 19 */:mu, Z1:$i]:(![X26:mu > $i > $o]:((((essence @ X26 @ Z0 @ Z1)=>(![X25:$i]:((~((rel @ Z1 @ X25))|(?[X24:mu]:((X26 @ X24 @ X25)))))))))))), inference(fof_simplification,[status(thm)],[defD3])).
0.20/0.52	thf(c_0_22, plain, ((mexists_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(?[X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mexists_ind])).
0.20/0.52	thf(c_0_23, axiom, ((mbox)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(![X21:$i]:((~((rel @ Z1 @ X21))|(Z0 @ X21)))))), inference(apply_def,[status(thm)],[mbox, c_0_17])).
0.20/0.52	thf(c_0_24, plain, ((mvalid)=(^[Z0/* 6 */:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
0.20/0.52	thf(c_0_25, plain, ((god)=(^[Z0/* 19 */:mu, Z1:$i]:(![X23:mu > $i > $o]:((((positive @ X23 @ Z1)=>(X23 @ Z0 @ Z1))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18, c_0_19]), c_0_20])).
0.20/0.52	thf(c_0_26, plain, ((necessary_existence)=(^[Z0/* 19 */:mu, Z1:$i]:(![X26:mu > $i > $o]:((((essence @ X26 @ Z0 @ Z1)=>(![X25:$i]:((~((rel @ Z1 @ X25))|(?[X24:mu]:((X26 @ X24 @ X25)))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_21, c_0_19]), c_0_20]), c_0_22]), c_0_23])).
0.20/0.52	thf(c_0_27, plain, ((mdia_generic)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(?[X16:$i]:(((Z0 @ Z2 @ X16)&(Z1 @ X16)))))), inference(fof_simplification,[status(thm)],[mdia_generic])).
0.20/0.52	thf(c_0_28, negated_conjecture, ~(![X32:$i, X31:$i]:((~(rel @ X32 @ X31)|?[X30:mu]:(![X29:mu > $i > $o]:(((positive @ X29 @ X31)=>(X29 @ X30 @ X31))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thmT3])]), c_0_22]), c_0_23]), c_0_24]), c_0_25])])).
0.20/0.52	thf(c_0_29, plain, ((mforall_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(![X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_ind])).
0.20/0.52	thf(c_0_30, plain, ![X44:$i]:((positive @ (^[Z0/* 19 */:mu, Z1:$i]:(![X41:mu > $i > $o]:(((essence @ X41 @ Z0 @ Z1)=>![X42:$i]:((~((rel @ Z1 @ X42))|?[X43:mu]:(X41 @ X43 @ X42))))))) @ X44)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axA5, c_0_24]), c_0_26])).
0.20/0.52	thf(c_0_31, axiom, ((mdia)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(?[X22:$i]:(((rel @ Z1 @ X22)&(Z0 @ X22)))))), inference(apply_def,[status(thm)],[mdia, c_0_27])).
0.20/0.52	thf(c_0_32, plain, ![X70:$i, X71:mu, X72:mu > $i > $o, X73:$i, X74:mu]:(((~(epred3_0 @ X71 @ X70)|(~(positive @ X72 @ X70)|(X72 @ X71 @ X70)))&(((positive @ (epred5_2 @ X73 @ X74) @ X73)|(epred3_0 @ X74 @ X73))&(~(epred5_2 @ X73 @ X74 @ X74 @ X73)|(epred3_0 @ X74 @ X73))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])])])).
0.20/0.52	thf(c_0_33, negated_conjecture, ![X49:mu]:(((rel @ esk1_0 @ esk2_0)&((positive @ (epred1_1 @ X49) @ esk2_0)&~(epred1_1 @ X49 @ X49 @ esk2_0)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])])])).
0.20/0.52	thf(c_0_34, lemma, ![X40:$i, X39:mu]:((![X37:mu > $i > $o]:(((positive @ X37 @ X40)=>(X37 @ X39 @ X40)))=>(essence @ (^[Z0/* 19 */:mu, Z1:$i]:(![X38:mu > $i > $o]:(((positive @ X38 @ Z1)=>X38 @ Z0 @ Z1)))) @ X39 @ X40))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[thmT2]), c_0_19]), c_0_29]), c_0_24]), c_0_25])).
0.20/0.52	thf(c_0_35, plain, ![X58:$i]:((positive @ (^[Z0/* 19 */:mu, Z1:$i]:(![X41:mu > $i > $o]:(((essence @ X41 @ Z0 @ Z1)=>![X42:$i]:((~((rel @ Z1 @ X42))|?[X43:mu]:(X41 @ X43 @ X42))))))) @ X58)), inference(variable_rename,[status(thm)],[c_0_30])).
0.20/0.52	thf(c_0_36, plain, ![X69:$i, X68:mu]:(((epred4_0 @ X68 @ X69)<=>![X65:mu > $i > $o]:(((essence @ X65 @ X68 @ X69)=>![X66:$i]:((~((rel @ X69 @ X66))|?[X67:mu]:((X65 @ X67 @ X66)))))))), introduced(definition)).
0.20/0.52	thf(c_0_37, lemma, ![X36:$i]:(?[X35:$i]:(((rel @ X36 @ X35)&?[X34:mu]:(![X33:mu > $i > $o]:(((positive @ X33 @ X35)=>(X33 @ X34 @ X35))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[corC]), c_0_22]), c_0_31]), c_0_24]), c_0_25])).
0.20/0.52	thf(c_0_38, plain, ![X1:mu, X6:mu > $i > $o, X3:$i]:(((X6 @ X1 @ X3)|~((epred3_0 @ X1 @ X3))|~((positive @ X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_32])).
0.20/0.52	thf(c_0_39, negated_conjecture, ![X1:mu]:((positive @ (epred1_1 @ X1) @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_33])).
0.20/0.52	thf(c_0_40, lemma, ![X55:$i, X56:mu]:((((positive @ (epred2_2 @ X55 @ X56) @ X55)|(essence @ (^[Z0/* 19 */:mu, Z1:$i]:(![X38:mu > $i > $o]:(((positive @ X38 @ Z1)=>X38 @ Z0 @ Z1)))) @ X56 @ X55))&(~(epred2_2 @ X55 @ X56 @ X56 @ X55)|(essence @ (^[Z0/* 19 */:mu, Z1:$i]:(![X38:mu > $i > $o]:(((positive @ X38 @ Z1)=>X38 @ Z0 @ Z1)))) @ X56 @ X55)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])])])).
0.20/0.52	thf(c_0_41, plain, ![X61:$i, X60:mu]:(((epred3_0 @ X60 @ X61)<=>![X59:mu > $i > $o]:(((positive @ X59 @ X61)=>(X59 @ X60 @ X61))))), introduced(definition)).
0.20/0.52	thf(c_0_42, plain, ![X16:$i]:((((positive @ epred4_0 @ X16))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_35]), c_0_36])).
0.20/0.52	thf(c_0_43, lemma, ![X51:$i, X54:mu > $i > $o]:(((rel @ X51 @ (esk3_1 @ X51))&(~(positive @ X54 @ (esk3_1 @ X51))|(X54 @ (esk4_1 @ X51) @ (esk3_1 @ X51))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])])])).
0.20/0.52	thf(c_0_44, plain, ((msymmetric)=(^[Z0/* 6 */:$i > $i > $o]:(![X17:$i, X18:$i]:(((Z0 @ X17 @ X18)=>(Z0 @ X18 @ X17)))))), inference(fof_simplification,[status(thm)],[msymmetric])).
0.20/0.52	thf(c_0_45, negated_conjecture, ![X1:mu]:(~((epred1_1 @ X1 @ X1 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_33])).
0.20/0.52	thf(c_0_46, negated_conjecture, ![X1:mu, X2:mu]:(((epred1_1 @ X1 @ X2 @ esk2_0)|~((epred3_0 @ X2 @ esk2_0)))), inference(spm,[status(thm)],[c_0_38, c_0_39])).
0.20/0.52	thf(c_0_47, plain, ![X76:$i, X77:mu, X78:mu > $i > $o, X79:$i, X81:$i, X82:mu, X85:mu]:(((~(epred4_0 @ X77 @ X76)|(~(essence @ X78 @ X77 @ X76)|(~(rel @ X76 @ X79)|(X78 @ (esk5_4 @ X76 @ X77 @ X78 @ X79) @ X79))))&(((essence @ (epred6_2 @ X81 @ X82) @ X82 @ X81)|(epred4_0 @ X82 @ X81))&(((rel @ X81 @ (esk6_2 @ X81 @ X82))|(epred4_0 @ X82 @ X81))&(~(epred6_2 @ X81 @ X82 @ X85 @ (esk6_2 @ X81 @ X82))|(epred4_0 @ X82 @ X81)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[])])])])])])])])).
0.20/0.52	thf(c_0_48, lemma, ![X1:mu, X3:$i]:(((((essence @ epred3_0 @ X1 @ X3))=(($true)))|~((epred2_2 @ X3 @ X1 @ X1 @ X3)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_40]), c_0_41])).
0.20/0.52	thf(c_0_49, lemma, ![X1:mu, X3:$i]:(((positive @ (epred2_2 @ X3 @ X1) @ X3)|(((essence @ epred3_0 @ X1 @ X3))=(($true))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_40]), c_0_41])).
0.20/0.52	thf(c_0_50, plain, ![X3:$i]:((positive @ epred4_0 @ X3)), inference(cn,[status(thm)],[c_0_42])).
0.20/0.52	thf(c_0_51, plain, ![X1:mu, X3:$i]:(((epred3_0 @ X1 @ X3)|~((epred5_2 @ X3 @ X1 @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_32])).
0.20/0.52	thf(c_0_52, lemma, ![X6:mu > $i > $o, X3:$i]:(((X6 @ (esk4_1 @ X3) @ (esk3_1 @ X3))|~((positive @ X6 @ (esk3_1 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_43])).
0.20/0.52	thf(c_0_53, plain, ![X1:mu, X3:$i]:(((positive @ (epred5_2 @ X3 @ X1) @ X3)|(epred3_0 @ X1 @ X3))), inference(split_conjunct,[status(thm)],[c_0_32])).
0.20/0.52	thf(c_0_54, plain, ![X27:$i, X28:$i]:(((rel @ X27 @ X28)=>(rel @ X28 @ X27))), inference(apply_def,[status(thm)],[sym, c_0_44])).
0.20/0.52	thf(c_0_55, negated_conjecture, ![X1:mu]:(~((epred3_0 @ X1 @ esk2_0))), inference(spm,[status(thm)],[c_0_45, c_0_46])).
0.20/0.52	thf(c_0_56, plain, ![X1:mu, X3:$i, X6:mu > $i > $o, X16:$i]:(((X6 @ (esk5_4 @ X3 @ X1 @ X6 @ X16) @ X16)|~((epred4_0 @ X1 @ X3))|~((essence @ X6 @ X1 @ X3))|~((rel @ X3 @ X16)))), inference(split_conjunct,[status(thm)],[c_0_47])).
0.20/0.52	thf(c_0_57, lemma, ![X1:mu, X3:$i]:(((essence @ epred3_0 @ X1 @ X3)|~((epred2_2 @ X3 @ X1 @ X1 @ X3)))), inference(cn,[status(thm)],[c_0_48])).
0.20/0.52	thf(c_0_58, lemma, ![X1:mu, X3:$i]:(((positive @ (epred2_2 @ X3 @ X1) @ X3)|(essence @ epred3_0 @ X1 @ X3))), inference(cn,[status(thm)],[c_0_49])).
0.20/0.52	thf(c_0_59, plain, ![X1:mu, X3:$i]:(((epred4_0 @ X1 @ X3)|~((epred3_0 @ X1 @ X3)))), inference(spm,[status(thm)],[c_0_38, c_0_50])).
0.20/0.52	thf(c_0_60, plain, ![X3:$i]:((epred3_0 @ (esk4_1 @ X3) @ (esk3_1 @ X3))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_52]), c_0_53])).
0.20/0.52	thf(c_0_61, plain, ![X45:$i, X46:$i]:((~(rel @ X45 @ X46)|(rel @ X46 @ X45))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])])])).
0.20/0.52	thf(c_0_62, negated_conjecture, ![X1:mu, X3:$i]:((~((essence @ epred3_0 @ X1 @ X3))|~((rel @ X3 @ esk2_0))|~((epred4_0 @ X1 @ X3)))), inference(spm,[status(thm)],[c_0_55, c_0_56])).
0.20/0.52	thf(c_0_63, lemma, ![X3:$i]:((essence @ epred3_0 @ (esk4_1 @ X3) @ (esk3_1 @ X3))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57, c_0_52]), c_0_58])).
0.20/0.52	thf(c_0_64, plain, ![X3:$i]:((epred4_0 @ (esk4_1 @ X3) @ (esk3_1 @ X3))), inference(spm,[status(thm)],[c_0_59, c_0_60])).
0.20/0.52	thf(c_0_65, plain, ![X3:$i, X16:$i]:(((rel @ X16 @ X3)|~((rel @ X3 @ X16)))), inference(split_conjunct,[status(thm)],[c_0_61])).
0.20/0.52	thf(c_0_66, lemma, ![X3:$i]:((rel @ X3 @ (esk3_1 @ X3))), inference(split_conjunct,[status(thm)],[c_0_43])).
0.20/0.52	thf(c_0_67, lemma, ![X3:$i]:(~((rel @ (esk3_1 @ X3) @ esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62, c_0_63]), c_0_64])])).
0.20/0.52	thf(c_0_68, lemma, ![X3:$i]:((rel @ (esk3_1 @ X3) @ X3)), inference(spm,[status(thm)],[c_0_65, c_0_66])).
0.20/0.52	thf(c_0_69, lemma, ($false), inference(spm,[status(thm)],[c_0_67, c_0_68]), ['proof']).
0.20/0.52	# SZS output end CNFRefutation
0.20/0.52	# Parsed axioms                        : 59
0.20/0.52	# Removed by relevancy pruning/SinE    : 0
0.20/0.52	# Initial clauses                      : 45
0.20/0.52	# Removed in clause preprocessing      : 29
0.20/0.52	# Initial clauses in saturation        : 16
0.20/0.52	# Processed clauses                    : 48
0.20/0.52	# ...of these trivial                  : 0
0.20/0.52	# ...subsumed                          : 1
0.20/0.52	# ...remaining for further processing  : 47
0.20/0.52	# Other redundant clauses eliminated   : 0
0.20/0.52	# Clauses deleted for lack of memory   : 0
0.20/0.52	# Backward-subsumed                    : 2
0.20/0.52	# Backward-rewritten                   : 0
0.20/0.52	# Generated clauses                    : 27
0.20/0.52	# ...of the previous two non-redundant : 22
0.20/0.52	# ...aggressively subsumed             : 0
0.20/0.52	# Contextual simplify-reflections      : 2
0.20/0.52	# Paramodulations                      : 27
0.20/0.52	# Factorizations                       : 0
0.20/0.52	# NegExts                              : 0
0.20/0.52	# Equation resolutions                 : 0
0.20/0.52	# Disequality decompositions           : 0
0.20/0.52	# Total rewrite steps                  : 4
0.20/0.52	# ...of those cached                   : 1
0.20/0.52	# Propositional unsat checks           : 0
0.20/0.52	#    Propositional check models        : 0
0.20/0.52	#    Propositional check unsatisfiable : 0
0.20/0.52	#    Propositional clauses             : 0
0.20/0.52	#    Propositional clauses after purity: 0
0.20/0.52	#    Propositional unsat core size     : 0
0.20/0.52	#    Propositional preprocessing time  : 0.000
0.20/0.52	#    Propositional encoding time       : 0.000
0.20/0.52	#    Propositional solver time         : 0.000
0.20/0.52	#    Success case prop preproc time    : 0.000
0.20/0.52	#    Success case prop encoding time   : 0.000
0.20/0.52	#    Success case prop solver time     : 0.000
0.20/0.52	# Current number of processed clauses  : 29
0.20/0.52	#    Positive orientable unit clauses  : 9
0.20/0.52	#    Positive unorientable unit clauses: 0
0.20/0.52	#    Negative unit clauses             : 3
0.20/0.52	#    Non-unit-clauses                  : 17
0.20/0.52	# Current number of unprocessed clauses: 6
0.20/0.52	# ...number of literals in the above   : 23
0.20/0.52	# Current number of archived formulas  : 0
0.20/0.52	# Current number of archived clauses   : 18
0.20/0.52	# Clause-clause subsumption calls (NU) : 83
0.20/0.52	# Rec. Clause-clause subsumption calls : 71
0.20/0.52	# Non-unit clause-clause subsumptions  : 3
0.20/0.52	# Unit Clause-clause subsumption calls : 13
0.20/0.52	# Rewrite failures with RHS unbound    : 0
0.20/0.52	# BW rewrite match attempts            : 1
0.20/0.52	# BW rewrite match successes           : 1
0.20/0.52	# Condensation attempts                : 48
0.20/0.52	# Condensation successes               : 0
0.20/0.52	# Termbank termtop insertions          : 3419
0.20/0.52	# Search garbage collected termcells   : 916
0.20/0.52	
0.20/0.52	# -------------------------------------------------
0.20/0.52	# User time                : 0.009 s
0.20/0.52	# System time              : 0.003 s
0.20/0.52	# Total time               : 0.011 s
0.20/0.52	# Maximum resident set size: 2096 pages
0.20/0.52	
0.20/0.52	# -------------------------------------------------
0.20/0.52	# User time                : 0.010 s
0.20/0.52	# System time              : 0.006 s
0.20/0.52	# Total time               : 0.016 s
0.20/0.52	# Maximum resident set size: 1788 pages
0.20/0.52	% E---3.1 exiting
0.20/0.53	% E exiting
0.20/0.53	EOF